Geometric Sequence Decomposition With <i>k</i>-Simplexes Transform

نویسندگان

چکیده

This paper presents a computationally efficient technique for decomposing non-orthogonally superposed $k$ geometric sequences. The method, which is named as sequence decomposition with $k$-simplexes transform (GSD-ST), based on the concept of transforming an observed to multiple in virtual $k$-dimensional space and correlating volumes transformed simplexes. Hence, GSD-ST turns problem sequences into one solving $k$-th order polynomial equation. Our has significance wireless communications because sampled points radio wave comprise sequence. implies that capable demodulating randomly combined waves, thereby eliminating effect interference. To exemplify potential GSD-ST, we propose new access scheme, namely non-orthogonal interference-free (No-INFRA). Herein, enables collision-free reception uncoordinated requests. Numerical results show No-INFRA effectively resolves colliding requests when interference dominant.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transform-invariant Image Decomposition with Similarity Templates

Recent work has shown impressive transform-invariant modeling and clustering for sets of images of objects with similar appearance. We seek to expand these capabilities to sets of images of an object class that show considerable variation across individual instances (e.g. pedestrian images) using a representation based on pixel-wise similarities, similarity templates. Because of its invariance ...

متن کامل

Morse Decomposition of Geometric Meshes with Applications

Large datasets describing geometric shapes are nowadays available in a variety of applications, including Geographical Information System. Handling such shapes require extensive computing resources. One of the most computer-intensive task is the analysis of their morphological structure. Morse Theory is a powerful theory, that is used to address the problem of describing topology, i.e., the sha...

متن کامل

Counting Simplexes in R

A finite set of vectors S ⊆ R is called a simplex iff S is linearly dependent but all its proper subsets are independent. This concept arises in particular from stoichiometry. We are interested in this paper in the number of simplexes contained in some H ⊆ R , which we denote by simp(H). This investigation is particularly interesting for H spanning R and containing no collinear vectors. Our mai...

متن کامل

The geometric mean decomposition

Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary...

متن کامل

Counting Simplexes in R3

A nite set of vectors S R n is called a simplex ii S is linearly dependent but all its proper subsets are independent. This concept arises in particular from stoichiometry. We are interested in this paper in the number of simplexes contained in

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2021

ISSN: ['1558-0857', '0090-6778']

DOI: https://doi.org/10.1109/tcomm.2020.3028876